Pii: S0167-8396(02)00165-6
نویسندگان
چکیده
We investigate the properties of a special kind of frame, which we call the Euler–Rodrigues frame (ERF), defined on the spatial Pythagorean-hodograph (PH) curves. It is a frame that can be naturally constructed from the PH condition. It turns out that this ERF enjoys some nice properties. In particular, a close examination of its angular velocity against a rotation-minimizing frame yields a characterization of PH curves whose ERF achieves rotationminimizing property. This computation leads into a new fact that this ERF is equivalent to the Frenet frame on cubic PH curves. Furthermore, we prove that the minimum degree of non-planar PH curves whose ERF is an rotation-minimizing frame is seven, and provide a parameterization of the coefficients of those curves. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0167-8396(02)00164-4
We study the relationship of transformations between Legendre and Bernstein basis. Using the relationship, we present a simple and efficient method for optimal multiple degree reductions of Bézier curves with respect to the L2-norm. 2002 Elsevier Science B.V. All rights reserved.
متن کاملPii: S0167-8396(02)00090-0
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial parametrization and by the absence of affine singularities. The algorithm requires O(n3 logn) field operations, where n is the degree of the curve. 2002 Elsevier Science B.V. All rights reserved.
متن کاملRefinement operators for triangle meshes
Refinement operators for triangular meshes as used in subdivision schemes or remeshing are discussed. A numbering scheme is presented, covering all refinement operators that (topologically) map vertices onto vertices. Using this characterization, some special properties of n-adic and √ 3-subdivision are easy to see.
متن کاملOn local search for the generalized graph coloring problem
Given an edge-weighted graph and an integer k, the generalized graph coloring problem is the problem of partitioning the vertex set into k subsets so as to minimize the total weight of the edges that are included in a single subset. We recall a result on the equivalence between Karush–Kuhn–Tucker points for a quadratic programming formulation and local optima for the simple 5ip-neighborhood. We...
متن کاملPii: S0167-8396(02)00124-3
The matrix forms for curves and surfaces were largely promoted in CAD/CAM. In this paper we have presented two matrix representation formulations for arbitrary degree NURBS curves and surfaces explicitly other than recursively. The two approaches are derived from the computation of divided difference and the Marsden identity respectively. The explicit coefficient matrix of B-spline with equally...
متن کامل